منابع مشابه
Dyson’s Ranks and Maass Forms
which were defined by Ramanujan and Watson decades ago. In his last letter to Hardy dated January 1920 (see pages 127-131 of [27]), Ramanujan lists 17 such functions, and he gives 2 more in his “Lost Notebook” [27]. In his paper “The final problem: An account of the mock theta functions” [32], Watson defines 3 further functions. Surprisingly, much remains unknown about these enigmatic series. R...
متن کاملGeometric lower bounds for generalized ranks
We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of [LT10] and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by the “non-Abelian” catalecticants recently introduced by Landsberg and Ottaviani. This is applied to give lower bounds for ranks of multihomogeneous polynomials (partially sy...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2015
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2015.05.025